New Ternary and Quaternary Equidistant Constant Weight Codes
نویسندگان
چکیده
We consider the problem of finding bounds on the size of ternary and quaternary equidistant constant weight codes. We present a computer realization of an algorithm for solving the maximum clique problem. We use it for finding the exact values of the maximum size for ternary and quaternary equidistant constant weight codes for all open cases for n ≤ 10 are found.
منابع مشابه
New Ternary and Quaternary Constant-Weight Equidistant Codes
Consider a finite set of q elements and containing a distinguished element ”zero”. The choice of a set does not matter in our context and we will use the set Zq of integers modulo q. Let Z q be the set of n-tuples (or vectors) over Zq and Z n,w q be the set of n-tuples over Zq of Hamming weight w. A code is called constant-weight if all the codewords have the same weight w. A code is called equ...
متن کاملLexicographic Constant-Weight Equidistant Codes over the Alphabet of Three, Four and Five Elements
In this paper we consider the problem of finding bounds on the size of lexicographic constant-weight equidistant codes over the alphabet of three, four and five elements with 2 ≤ w < n ≤ 10. Computer search of lexicographic constant-weight equidistant codes is performed. Tables with bounds on the size of lexicographic constant-weight equidistant codes are presented.
متن کاملOn Equidistant Constant Weight Codes
Equidistant constant weight codes are studied in this paper. The dual distance distribution of equidistant constant weight codes is investigated and used to obtain upper bounds on the size of such codes as well as equidistant codes in general. ? 2003 Elsevier Science B.V. All rights reserved.
متن کاملMethods for equidistant code search in computer package QPlus
New tools in computer package for coding theory research and studying QPlus are presented. QPlus includes a DLL library package that implements coding theory algorithms. We consider some methods for searching bounds on the size of q-ary equidistant codes by computer methods. Some examples for optimal equidistant codes and constant-weight equidistant codes that have been constructed by computer ...
متن کاملSome ternary and quaternary codes and associated sphere packings
Tables are presented of good ternary and quaternary codes and they are used in the construction of dense sphere packings. Results include 1) tables of the best ternary and quaternary constacyclic codes (including cyclic codes) up to block length 50, 2 ) a class of optimal [ n , 21 codes over GF(q), 3) the ( U + U + w I2u + U I U ) construction, a new ternary code construction technique that can...
متن کامل